A note on the stability of the LU factorization of Hessenberg matrices
نویسندگان
چکیده
In this paper we show that Doolittle’s method to compute the LU factorization of Hessenberg matrices is mixed forward-backward stable and therefore, componentwise forward stable. We also conjecture that this algorithm for computing the LU factorization of dense matrices is forward stable.
منابع مشابه
THE USE OF SEMI INHERITED LU FACTORIZATION OF MATRICES IN INTERPOLATION OF DATA
The polynomial interpolation in one dimensional space R is an important method to approximate the functions. The Lagrange and Newton methods are two well known types of interpolations. In this work, we describe the semi inherited interpolation for approximating the values of a function. In this case, the interpolation matrix has the semi inherited LU factorization.
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملContemporary Mathematics The Schur algorithm for matrices with Hessenberg displacement structure
A Schur-type algorithm is presented for computing recursively the triangular factorization R = LU of a strongly nonsingular n n matrix satisfying a displacement equation RY V R = GH with Hessenberg matrices Y and V and n matrices G, H. If is small compared with n and the matrices Y and V admit fast matrix-vector multiplication, the new algorithm is fast in the sense that it will require less th...
متن کاملCounting Determinants of Fibonacci-hessenberg Matrices Using Lu Factorizations
is a Hessenberg matrix and its determinant is F2n+2. Furthermore, a Hessenberg matrix is said to be a Fibonacci-Hessenberg matrix [2] if its determinant is in the form tFn−1 + Fn−2 or Fn−1 + tFn−2 for some real or complex number t. In [1] several types of Hessenberg matrices whose determinants are Fibonacci numbers were calculated by using the basic definition of the determinant as a signed sum...
متن کامل